Who\u27s That Again?

When a student came to my office to introduce himself as Roy King, my onomastic perception quotient was immediately activated; I realized that what I had here was a prime example of an onomastic tautology. For the cognoscenti, further explanation of this is probably not necessary, but as I often find myself in the rands of the incognoscenti, let me explain that even though the words have different linguistic origins, they denote the same idea and have the same meaning. (Roy is French or Anglo-American for King.

The Power of a Prefix

THe first letter of the alphabet serves many linguistic purposes and numerous grammatical functions. One that has intrigued this writer is the way in which a humble lower case a prefix can semantically transform different types of words. This can be in terms of a manner (loud, aloud), a condition (live, alive), a state (lone, alone), or action (rising, arising). Relevant applications can be with nouns, verbs (particularly with present participles), adverbs or prepositions

Numerical inverse scattering for the Korteweg–-de Vries and modified Korteweg–-de Vries equations

Recent advances in the numerical solution of Riemann–Hilbert problems allow for the implementation of a Cauchy initial value problem solver for the Korteweg–de Vries equation (KdV) and the defocusing modified Korteweg–de Vries equation (mKdV), without any boundary approximation. Borrowing ideas from the method of nonlinear steepest descent, this method is demonstrated to be asymptotically accurate. The method is straightforward for the case of defocusing mKdV due to the lack of poles in the Riemann–Hilbert problem and the boundedness properties of the reflection coefficient. Solving KdV requires the introduction of poles in the Riemann–Hilbert problem and more complicated deformations. The introduction of a new deformation for KdV allows for the stable asymptotic computation of the solution in the entire (x, t)-plane. KdV and mKdV are dispersive equations and this method can fully capture the dispersion with spectral accuracy. Thus, this method can be used as a benchmarking tool for determining the effectiveness of future numerical methods designed to capture dispersion. This method can easily be adapted to other integrable equations with Riemann–Hilbert formulations, such as the nonlinear Schrödinger equation

Performance Evaluation of the Labelled OBS Architecture

A comparison of three different Optical Burst Switching (OBS) architectures is made, in terms of performance criteria, control and hardware complexity, fairness, resource utilization, and burst loss probability. Regarding burst losses, we distinguish the losses due to burst contentions from those due to contentions of Burst Control Packets (BCP). The simulation results show that as a counterpart of an its additional hardware complexity, the labelled OBS (L-OBS) is an efficient OBS architecture compared to a Conventional OBS (C-OBS) as well as in comparison with Offset Time-Emulated OBS (E-OBS)

Parameters of the lowest order chiral Lagrangian from fermion eigenvalues

Recent advances in Random Matrix Theory enable one to determine the pseudoscalar decay constant from the response of eigenmodes of quenched fermions to an imaginary isospin chemical potential. We perform a pilot test of this idea, from simulations with two flavors of dynamical overlap fermions.Comment: 11 pages, 7 figures, Revte